Chemistry of spider's thread.
نویسندگان
چکیده
منابع مشابه
Spatial learning affects thread tension control in orb-web spiders.
Although it is well known that spatial learning can be important in the biology of predators that actively move around in search for food, comparatively little is known about ways in which spatial learning might function in the strategies of sit-and-wait predators. In this study, Cyclosa octotuberculata, an orb-web spider that uses its legs to contract radial threads of its web to increase thre...
متن کاملThread Thread Thread Thread Thread Thread �
We present the design and implementation of Arachne, a threads system that can be interfaced with a communications library for multi-threaded distributed computations. In particular, Arachne supports thread migration between heterogeneous platforms, with dynamic stack size management and recursive thread functions. Arachne is eecient, exible and portable | it is based entirely on C and C++. To ...
متن کاملThread A Thread B Thread C
In this paper we classify simultaneous multithreaded architectures based on how they select instructions issued in a single cycle. This classiication allows us to study the present trend of technology as well as to explore the new avenues for improvements in simultaneous multithreaded architectures. Based on our classi-cation, we study the impact of various parameters of simultaneous multithrea...
متن کاملTime More speculative Thread 1 Thread 2 Spawned Thread 2 Thread 2 finishes Thread
With the current trend toward multicore architectures, improved execution performance can no longer be obtained via traditional single-thread instruction level parallelism (ILP), but, instead, via multithreaded execution. Generating thread-parallel programs is hard and thread-level speculation (TLS) has been suggested as an execution model that can speculatively exploit thread-level parallelism...
متن کاملTough spiders
Spider graphs are the intersection graphs of subtrees of subdivisions of stars. Thus, spider graphs are chordal graphs that form a common superclass of interval and split graphs. Motivated by previous results on the existence of Hamilton cycles in interval, split and chordal graphs, we show that every 3/2-tough spider graph is hamiltonian. The obtained bound is best possible since there are (3/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Synthetic Organic Chemistry, Japan
سال: 1985
ISSN: 0037-9980,1883-6526
DOI: 10.5059/yukigoseikyokaishi.43.828